Constructing Trees with Graceful Labellings Using Caterpillars
نویسندگان
چکیده
Hrnciar and Haviar [3] gave a method to a construct a graceful labeling for all trees of diameter at most five. Based on their method and the methods described in Balbuena et al [1], we shall describe a new construction for gracefully labeled trees by attaching trees to the vertices of a tree admitting a bipartite graceful labeling.
منابع مشابه
Constructing Graceful Graphs with Caterpillars
A graceful labeling of a graph G of size n is an injective assignment of integers from {0, 1,..., n} to the vertices of G, such that when each edge of G has assigned a weight, given by the absolute dierence of the labels of its end vertices, the set of weights is {1, 2,..., n}. If a graceful labeling f of a bipartite graph G assigns the smaller labels to one of the two stable sets of G, then f ...
متن کاملSnakes and Caterpillars in Graceful Graphs
Graceful labelings use a prominent place among difference vertex labelings. In this work we present new families of graceful graphs all of them obtained applying a general substitution result. This substitution is applied here to replace some paths with some trees with a more complex structures. Two caterpillars with the same size are said to be textit{analogous} if thelarger stable sets, in bo...
متن کاملConnections between labellings of trees
There are many long-standing conjectures related with some labellings of trees. It is important to connect labellings that are related with conjectures. We find some connections between known labellings of simple graphs.
متن کاملImproper Graceful and Odd-graceful Labellings of Graph Theory
Abstract In this paper we define some new labellings for trees, called the in-improper and out-improper odd-graceful labellings such that some trees labelled with the new labellings can induce graceful graphs having at least a cycle. We, next, apply the new labellings to construct large scale of graphs having improper graceful/odd-graceful labellings or having graceful/odd-graceful labellings.
متن کاملRelaxed Graceful Labellings of Trees
A graph G on m edges is considered graceful if there is a labelling f of the vertices of G with distinct integers in the set {0, 1, . . . ,m} such that the induced edge labelling g defined by g(uv) = |f(u) − f(v)| is a bijection to {1, . . . ,m}. We here consider some relaxations of these conditions as applied to tree labellings: 1. Edge-relaxed graceful labellings, in which repeated edge label...
متن کامل